Triangle colorings require at least seven colors
نویسندگان
چکیده
We show that if a coloring of the plane has properties any two points at distance one are colored differently and is partitioned into uniformly triangles under certain conditions, then it requires least seven colors. This also true for using polygons point bordering four polygons.
منابع مشابه
On Edge Colorings with at Least q Colors in Every Subset of p Vertices
For fixed integers p and q, an edge coloring of Kn is called a (p, q)-coloring if the edges of Kn in every subset of p vertices are colored with at least q distinct colors. Let f(n, p, q) be the smallest number of colors needed for a (p, q)-coloring of Kn. In [3] Erdős and Gyárfás studied this function if p and q are fixed and n tends to infinity. They determined for every p the smallest q (= (...
متن کاملBeyond the Vizing's bound for at most seven colors
Let G = (V,E) be a simple graph of maximum degree ∆. The edges of G can be colored with at most ∆ + 1 colors by Vizing’s theorem. We study lower bounds on the size of subgraphs of G that can be colored with ∆ colors. Vizing’s Theorem gives a bound of ∆ ∆+1 |E|. This is known to be tight for cliques K∆+1 when ∆ is even. However, for ∆ = 3 it was improved to 26 31 |E| by Albertson and Haas [Parsi...
متن کاملDisconnected Colors in Generalized Gallai-Colorings
Gallai-colorings of complete graphs—edge colorings such that no triangle is colored with three distinct colors—occur in various contexts such as the theory of partially ordered sets (in Gallai’s original paper), information theory and the theory of perfect graphs. A basic property of GallaiQ1 colorings with at least three colors is that at least one of the color classes must span a disconnected...
متن کاملLarge Subgraphs in Rainbow-Triangle Free Colorings
Fox–Grishpun–Pach showed that every 3-coloring of the complete graph on n vertices without a rainbow triangle contains a set of order Ω ( n log n ) which uses at most two colors, and this bound is tight up to the constant factor. We show that if instead of looking for large cliques one only tries to find subgraphs of large chromatic number, one can do much better. We show that every such colori...
متن کاملRamsey numbers in rainbow triangle free colorings
Given a graph G, we consider the problem of finding the minimum number n such that any k edge colored complete graph on n vertices contains either a three colored triangle or a monochromatic copy of the graph G. This number is found precisely for a C4 and all trees on at most 6 vertices and bounds are provided for general paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2021.112411